Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
61	Increasing the Minimum Degree of a Graph by Contractions? Petr A. Golovach1 , Marcin Kami´ nski2 , Dani¨el Paulusma1 , and Dimitrios M. Thilikos3 1 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2011-07-20 16:50:25 Graph theory Mathematics NP-complete problems Graph operations Graph coloring Graph Edge contraction Longest path problem Vertex Cycle Line graph Vertex cover
62	Capacity of Arbitrary Wireless Networks Olga Goussevskaia Roger Wattenhofer Computer Engineering and Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:24 Computational complexity theory Graph theory Mathematics NP-complete problems Combinatorial optimization NP-hard problems Graph coloring Signal-to-interference-plus-noise ratio NC Open set Independent set Matching
63	Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2014-01-31 12:40:59 Graph theory NP-complete problems Circular-arc graph Hamiltonian path Intersection graph Graph Path Interval graph Chordal graph Indifference graph Longest path problem Split graph
64	Spectral Graph Theory Lecture 5 Rings, Paths, and Paley Graphs Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2015-08-17 14:43:26 Graph theory Mathematics Algebra Algebraic graph theory Matrices NP-complete problems Eigenvalues and eigenvectors Linear algebra Singular value decomposition Paley graph Adjacency matrix Matrix
65	Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2014-09-25 06:28:22 Graph theory Mathematics NP-complete problems Combinatorial optimization Graph connectivity Graph coloring Graph Matching Triadic closure Clique problem Vertex cover Clique
66	DOUGLAS BAUER Professor Mathematical Sciences Department Stevens Institute of Technology EDUCATION Ph.D., Stevens Institute of Technology, 1978 Add to Reading List Source URL: personal.stevens.edu Language: English - Date: 2011-06-27 08:31:04 Graph theory NP-complete problems Extremal graph theory Line graph Cubic graph Graph Cycle Regular graph Hamiltonian path
67	Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne, Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Graph theory Computational complexity theory Mathematics Spanning tree NP-complete problems Approximation algorithms Steiner tree problem Complexity classes APX Combinatorial optimization Minimum spanning tree Cut
68	On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´ Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:44:58 Graph theory Mathematics Spanning tree Operations research NP-complete problems Dynamic programming Equations Systems engineering Vertex cover Minimum spanning tree
69	Petr Kolman Bernard Lidick´ y Jean-S´ebastien Sereni ON FAIR EDGE DELETION PROBLEMS ´ AND J.-S. SERENI P. KOLMAN, B. LIDICKY, Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2009-09-29 04:25:56 Graph theory Graph coloring NP-complete problems Combinatorial optimization Matching Treewidth Graph Bipartite graph Planar graph Ear decomposition Degree Line graph

UPDATE